Relative Doubt: Partial Match or “Familial” Searches of DNA Databases
نویسندگان
چکیده
In 2005, Denver District Attorney Mitchell Morrissey had DNA samples from three unsolved rape cases, but a search in the national DNA database had failed to turn up any matches. Typically, such a search looks for perfect identity between a crime-scene sample and a known offender using thirteen genetic markers. However, the software used for matching returns can return not only perfect matches, but also near or “partial” matches of fewer markers. Because genetic information is inherited, such partial matches may point toward a relative of the source, which in turn could lead to the perpetrator of the offense. In Morrissey’s cases, the search revealed several of these near-matches -one in each case, in fact. The only problem was that the matches came from the Oregon, Arizona, and California databases, and the national database stores entries anonymously, allowing each state to keep the identifying information of its offenders. Accordingly, Morrissey had to request the matching persons’ names from the federal government. And while federal rules did not prohibit a state from accessing information about its own offenders in such partial-match cases, they did not authorize the sharing of such information across jurisdictions. Thus, the head of the federal DNA database refused to disclose the names of the potential relatives. Frustrated by his inability to pursue the partial matches, Morrissey wrote to the director of the FBI laboratories, complaining that the policy “protects murderers and rapists.” Several days later, FBI Director Robert Mueller called Morrissey to discuss the issue. Shortly after that, Mueller ordered the adoption of an interim policy, which permitted states to decide for themselves whether to share the identities of persons in the database revealed in partial match searches. Arizona and Oregon then complied with Morrissey’s request, but California resisted. After a campaign by the state’s sheriff and district attorneys’ organizations, however, Attorney General Jerry Brown radically changed course. In April of 2008, Brown announced that California would not only share such information, but also laid out the first policy in the nation
منابع مشابه
Familial Identification: Population Structure and Relationship Distinguishability
With the expansion of offender/arrestee DNA profile databases, genetic forensic identification has become commonplace in the United States criminal justice system. Implementation of familial searching has been proposed to extend forensic identification to family members of individuals with profiles in offender/arrestee DNA databases. In familial searching, a partial genetic profile match betwee...
متن کاملTrawling Dna Databases for Partial Matches: What Is the Fbi Afraid Of?
DNA evidence is often presented as the “gold standard” for forensic science. But this was not always the case. For years, eminent scientists complained that the estimates of the tiny frequencies of DNA types were unfounded. It took scores of research papers, dozens of judicial opinions, and two committees of the National Academy of Sciences to resolve the dispute by the mid-1990s. Since 2000, h...
متن کاملFreestyle vs. Boolean: A Comparison of Partial and Exact Match Retrieval Systems
-Although Boolean searching has been the standard model for commercial information retrieval systems for the past three decades, natural language input and partial-match weighted retrieval have recently emerged from the laboratories to become a searching option in several well-known online systems. The purpose of this investigation is to compare the performance of one of these partial match opt...
متن کاملThe ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, we proposed an index structure called the ed-tree for supporting fast and effective homology searches on DNA databases. The ed-tree is developed to enable probe-based homology search algorithms like Blastn which generat...
متن کاملFast search in DNA sequence databases using punctuation and indexing
Exact pattern searching in DNA sequence databases has applications in identification of highly conserved regulatory sequences, the design of hybridization probes, and improving performance of approximate homology searching tools such as BLAST and BLAT. We propose a new pattern searching algorithm, CompressedPunctuated-Boyer-Moore (cp-BM), to enhance exact pattern match searches of DNA sequences...
متن کامل